Simulation distances
نویسندگان
چکیده
منابع مشابه
Simulation Distances
Boolean notions of correctness are formalized by preorders on systems. Quantitative measures of correctness can be formalized by realvalued distance functions between systems, where the distance between implementation and specification provides a measure of “fit” or “desirability.” We extend the simulation preorder to the quantitative setting, by making each player of a simulation game pay a ce...
متن کاملInterface simulation distances
The classical (boolean) notion of refinement for behavioral interfaces of system components is the alternating refinement preorder. In this paper, we define a distance for interfaces, called interface simulation distance. It makes the alternating refinement preorder quantitative by, intuitively, tolerating errors (while counting them) in the alternating simulation game. We show that the interfa...
متن کامل20/5000 Eliminate Distances
انگلستان، کشوری با فرهنگ های متعدد است. طبق آمار سال ۱۹۸۵، حدود یک درصد از جمعیت انگلستان را نژادهای آفریقایی یا منطقه کارائیب و ۲/۳ درصد آن را نژادهای آسیایی (۱/ ۴ درصد هندی، ۰/ ۷ درصد پاکستانی و ۲/۰ درصد بنگلادشی) تشکیل می دهند. حدود ۱ تا ۲ درصد از کل جمعیت انگلستان به دیابت مبتلا هستند که در سپاهان به نسبت شایعتر می باشد شیوع دیابت در نژادهای آسیایی ۳ تا ۴ برابر بیشتر از سایر نژادهای این کش...
متن کاملOn properties of ω-automata using simulation distances
It is interesting to study properties of abstract metric spaces. Here we define metrics on the set of finite state automata A (over a fixed set of transition symbols Σ), and study their properties. We define simulation games on automata with a finite Σ, but we later move on to more general automata, where Σ is treated as a metric space itself. We then consider the original case and construct mi...
متن کاملAdditive Distances and Quasi-Distances Between Words
We study additive distances and quasi-distances between words. We show that every additive distance is finite. We then prove that every additive quasi-distance is regularity-preserving, that is, the neighborhood of any radius of a regular language with respect to an additive quasi-distance is regular. Finally, similar results will be proven for context-free, computable and computably enumerable...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2012
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2011.08.002